Evolutionary dynamics on graphs: Efficient method for weak selection
نویسندگان
چکیده
منابع مشابه
Evolutionary dynamics on graphs: Efficient method for weak selection.
Investigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spati...
متن کاملEvolutionary Dynamics on Small-order Graphs
We study the stochastic birth-death model for structured finite populations popularized by Lieberman et al. [Lieberman, E., Hauert, C., Nowak, M.A., 2005. Evolutionary dynamics on graphs. Nature 433, 312-316]. We consider all possible connected undirected graphs of orders three through eight. For each graph, using the Monte Carlo Markov Chain simulations, we determine the fixation probability o...
متن کاملEvolutionary dynamics on degree-heterogeneous graphs.
The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model dynamics) or by an individual giving birth to an offspring that takes over a random neighbor node (invasion process dynamics). The fixation probability for one species to ta...
متن کاملExtrapolating Weak Selection in Evolutionary Games
In evolutionary games, reproductive success is determined by payoffs. Weak selection means that even large differences in game outcomes translate into small fitness differences. Many results have been derived using weak selection approximations, in which perturbation analysis facilitates the derivation of analytical results. Here, we ask whether results derived under weak selection are also qua...
متن کاملSpatial evolutionary games with weak selection.
Recently, a rigorous mathematical theory has been developed for spatial games with weak selection, i.e., when the payoff differences between strategies are small. The key to the analysis is that when space and time are suitably rescaled, the spatial model converges to the solution of a partial differential equation (PDE). This approach can be used to analyze all [Formula: see text] games, but t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2009
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.79.046707